Standard topological algebras: syntactic and principal congruences and profiniteness

نویسندگان

  • David M. Clark
  • Brian A. Davey
  • Ralph S. Freese
  • Marcel Jackson
  • Ralph N. McKenzie
چکیده

A topological quasi-variety Q T ∼ ) := IScP + ∼ generated by a finite algebra ∼ with the discrete topology is said to be standard if it admits a canonical axiomatic description. Drawing on the formal language notion of syntactic congruences, we prove that Q T ∼ ) is standard provided that the algebraic quasi-variety generated by ∼ is a variety, and that syntactic congruences in that variety are determined by a finite set of terms. We give equivalent semantic and syntactic conditions for a variety to have Finitely Determined Syntactic Congruences (FDSC), show that FDSC is equivalent to a natural generalisation of Definable Principle Congruences (DPC) which we call Term Finite Principle Congruences (TFPC), and exhibit many familiar algebras ∼ that our method reveals to be standard. As an application of our results we show, for example, that every Boolean topological lattice belonging to a finitely generated variety of lattices is profinite and that every Boolean topological group, semigroup, and ring is profinite. While the latter results are well known, the result on lattices was previously known only in the distributive case. 1. Background, motivation and overview of results An algebraM = 〈M ;F 〉 with finite underlying setM and operations F generates an (algebraic) quasi-variety Q(M) := ISPM consisting of all isomorphic copies of subalgebras of direct powers of M. Similarly a structure M∼ = 〈M ;G,H,R,T 〉 with finite underlying setM , operationsG, partial operationsH , relationsR and discrete topology T generates a topological quasi-variety Q+T (M∼ ) := IScP + M∼ consisting of all isomorphic copies of topologically closed substructures of non-zero direct powers, with the product topology, of M∼ . Interest in topological quasi-varieties stems from the fact that they arise as the duals to algebraic quasi-varieties under natural dualities. The general theory of natural dualities provides methods to Presented by R. W. Quackenbush. Received October 19, 2002; accepted in final form October 21, 2004. 2000 Mathematics Subject Classification: 08C15, 03C99, 68Q45, 54H11, 54H12, 06B30, 06B20, 20E18 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Various topological forms of Von Neumann regularity in Banach algebras

We study topological von Neumann regularity and principal von Neumann regularity of Banach algebras. Our main objective is comparing these two types of Banach algebras and some other known Banach algebras with one another. In particular, we show that the class of topologically von Neumann regular Banach algebras contains all $C^*$-algebras, group algebras of compact abelian groups and ...

متن کامل

A new branch of the logical algebra: UP-algebras

In this paper, we introduce a new algebraic structure, called a UP-algebra (UP means the University of Phayao) and a concept of UP-ideals, UP-subalgebras, congruences and UP-homomorphisms in UP-algebras, and investigated some related properties of them. We also describe connections between UP-ideals, UP-subalgebras, congruences and UP-homomorphisms, and show that the notion of UP-algebras is a ...

متن کامل

T-FUZZY CONGRUENCES AND T-FUZZY FILTERS OF A BL-ALGEBRA

In this note, we introduce the concept of a fuzzy filter of a BLalgebra,with respect to a t-norm briefly, T-fuzzy filters, and give some relatedresults. In particular, we prove Representation Theorem in BL-algebras. Thenwe generalize the notion of a fuzzy congruence (in a BL-algebra) was definedby Lianzhen et al. to a new fuzzy congruence, specially with respect to a tnorm.We prove that there i...

متن کامل

Varieties of Unranked Tree Languages

We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages are defined similarly as for ranked tree languages, and an unranked tree language is shown to be recognizable iff its syntactic algebra is regular, i.e., a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004